A provable secure anonymous proxy signature scheme without random oracles
نویسندگان
چکیده
In order to protect the proxy signers’ privacy, many anonymous proxy signature schemes which are also called proxy ring signatures, have been proposed. Although the provable security in the random oracle model has received a lot of criticism, there is no provable secure anonymous proxy signature scheme without random oracles. In this paper, we propose the first provable secure anonymous proxy signature scheme without random oracles which is the combination of proxy signature and ring signature. For the security analysis, we categorize the adversaries into three types according to different resources they can get and prove in the standard model that, our proposal is anonymous against full key exposure and existential unforgeable against all kinds of adversaries with the computational Diffie–Hellman and the subgroup hiding assumptions in bilinear groups.
منابع مشابه
Sequential Aggregate Signatures and Multisignatures Without Random Oracles
We present the first aggregate signature, the first multisignature, and the first verifiably encrypted signature provably secure without random oracles. Our constructions derive from a novel application of a recent signature scheme due to Waters. Signatures in our aggregate signature scheme are sequentially constructed, but knowledge of the order in which messages were signed is not necessary f...
متن کاملRemark on Shao et al.'s Bidirectional Proxy Re-signature Scheme in Indocrypt'07
Recently, Shao et al. proposed two bidirectional proxy re-signature schemes Smb and Sid−mb [3]. In their paper, the authors gave security proofs to say that both of them are secure in their security model without random oracles. But, we found that the scheme Smb is miss leaded and its security proof is false. In this paper, we present an attack on Smb and improve it to be secure in their securi...
متن کاملFully Anonymous Group Signatures without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elements, and the scheme permits dynamic enrollment of new members. The scheme satisfies strong security requirements, in particular providing protection against key exposures and not relying on random oracles in the secur...
متن کاملIdentity-Based Strong Key-Insulated Signature Without Random Oracles
It is a worthwhile challenge to deal with the key-exposure problem in identity-based signatures. To deal with this problem, this paper adopts Dodis, et al.’s key-insulation mechanism to identity-based signature scenarios, and proposes an identity-based key-insulated signature scheme. The proposed scheme enjoys two attractive features: (i) it is strong key-insulated; (ii) it is provably secure w...
متن کاملAn Efficient Verifiably Encrypted Signature Scheme without Random Oracles
In this paper, we propose an efficient verifiably encrypted signature scheme based on bilinear pairings. The proposed scheme is proven secure without random oracles. Our scheme has a tight security reduction to a strong but reasonable computational assumption. To the best of our knowledge, it is the third one of this kind in the literature to achieve this security level.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013